Generalized matrix spectral factorization and quasi-tight framelets with a minimum number of generators

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some Bivariate Smooth Compactly Supported Tight Framelets with Three Generators

For any 2×2 dilation matrix with integer entries and | detA| = 2, we construct a family of smooth compactly supported tight wavelet frames with three generators in L2(R). Our construction involves some compactly supported refinable functions, the Oblique Extension Principle and a slight generalization of a theorem of Lai and Stöckler. Estimates for the degrees of smoothness are given. With the ...

متن کامل

Tight Semi-Nonnegative Matrix Factorization

The nonnegative matrix factorization is a widely used, flexible matrix decomposition, finding applications in biology, image and signal processing and information retrieval, among other areas. Here we present a related matrix factorization. A multi-objective optimization problem finds conical combinations of templates that approximate a given data matrix. The templates are chosen so that as far...

متن کامل

Optimization of Quasi Random Number Generators

Monte Carlo simulations are based on Random Number Generators (RNG). Drawing random numbers often constitutes a considerable part of simulation time. Unrolling random numbers is a way to accelerate Monte Carlo simulations appreciably by speeding up any RNG. This method consists in a pre-generation and storage of random numbers in an array of values. This array is either directly included in the...

متن کامل

Tight convex relaxations for sparse matrix factorization

Based on a new atomic norm, we propose a new convex formulation for sparse matrix factorization problems in which the number of non-zero elements of the factors is assumed fixed and known. The formulation counts sparse PCA with multiple factors, subspace clustering and low-rank sparse bilinear regression as potential applications. We compute slow rates and an upper bound on the statistical dime...

متن کامل

Empirical Spectral Analysis of Random Number Generators

ABSTRACT. Computer simulation procedures have become a staple of research and development in many fields, including statistics. The generation of random number sequences is critical to these procedures. The validity of research results often depend on the underlying validity of the generator being used. In this work we develop the theory for the Empirical Spectral Test (EST). The EST is a class...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics of Computation

سال: 2020

ISSN: 0025-5718,1088-6842

DOI: 10.1090/mcom/3523